Structure of node polynomials for curves on surfaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Node Polynomials for Plane Curves

According to the Göttsche conjecture (now a theorem), the degree N of the Severi variety of plane curves of degree d with δ nodes is given by a polynomial in d, provided d is large enough. These “node polynomials” Nδ(d) were determined by Vainsencher and Kleiman–Piene for δ ≤ 6 and δ ≤ 8, respectively. Building on ideas of Fomin and Mikhalkin, we develop an explicit algorithm for computing all ...

متن کامل

Relative node polynomials for plane curves

We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and δ nodes is given by a polynomial in d , provided δ is fixed and d is large enough. We extend this result to generalized Severi varieties parametrizing plane curves that, in addition, satisfy tangency conditions of given orders wit...

متن کامل

Bezier curves and surfaces based on modified Bernstein polynomials

. Parametric curves are represented using these modified Bernstein basis and the concept of total positivity is applied to investigate the shape properties of the curve. We get Bézier curve defined on [0, 1] when we set the parameter α, β to the value 0. We also present a de Casteljau algorithm to compute Bernstein Bézier curves and surfaces with shifted knots. The new curves have some properti...

متن کامل

the structure of lie derivations on c*-algebras

نشان می دهیم که هر اشتقاق لی روی یک c^*-جبر به شکل استاندارد است، یعنی می تواند به طور یکتا به مجموع یک اشتقاق لی و یک اثر مرکز مقدار تجزیه شود. کلمات کلیدی: اشتقاق، اشتقاق لی، c^*-جبر.

15 صفحه اول

Fitting Curves and Surfaces With Constrained Implicit Polynomials

A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: Although the data set is simple, the fit exhibits undesired phenomena, such as loops, holes, extraneous components, etc. Previous work tackled these problems by optimizing heuristic cost functions, which penalize some of these topological problems in the fit. This paper suggests a different ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Nachrichten

سال: 2014

ISSN: 0025-584X

DOI: 10.1002/mana.201200265